expansion bus bottleneck - перевод на итальянский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:     

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

expansion bus bottleneck - перевод на итальянский

Bottleneck network; Bottleneck link

expansion bus bottleneck      
Ingorgo nel canale di espansione
address bus         
  • conventional PCI]] bus card slot (very bottom)
SYSTEM THAT TRANSFERS DATA BETWEEN COMPONENTS WITHIN A COMPUTER
Data bus; Address bus; Computer buses; Memory bus; Bus (computer); I/O bus; Internal bus; 100MHz bus; 133MHz bus; Asynchronous bus; Synchronous bus; PC bus; Hardware bus; External data bus; Computer bus; RAM bus; External bus; Cache bus; Digital bus; Computer/bus; Interconnect (computing); Data buses; Draft:Data Bus; Data highway; Address line; Motherboard bus; Processor bus
bus indirizzi
data bus         
  • conventional PCI]] bus card slot (very bottom)
SYSTEM THAT TRANSFERS DATA BETWEEN COMPONENTS WITHIN A COMPUTER
Data bus; Address bus; Computer buses; Memory bus; Bus (computer); I/O bus; Internal bus; 100MHz bus; 133MHz bus; Asynchronous bus; Synchronous bus; PC bus; Hardware bus; External data bus; Computer bus; RAM bus; External bus; Cache bus; Digital bus; Computer/bus; Interconnect (computing); Data buses; Draft:Data Bus; Data highway; Address line; Motherboard bus; Processor bus
Canale di dati (collegamento fra l"elaboratore centrale e la memoria)

Определение

computer bus

Википедия

Bottleneck (network)

In a communication network, sometimes a max-min fairness of the network is desired, usually opposed to the basic first-come first-served policy. With max-min fairness, data flow between any two nodes is maximized, but only at the cost of more or equally expensive data flows. To put it another way, in case of network congestion any data flow is only impacted by smaller or equal flows.

In such context, a bottleneck link for a given data flow is a link that is fully utilized (is saturated) and of all the flows sharing this link, the given data flow achieves maximum data rate network-wide. Note that this definition is substantially different from a common meaning of a bottleneck. Also note, that this definition does not forbid a single link to be a bottleneck for multiple flows.

A data rate allocation is max-min fair if and only if a data flow between any two nodes has at least one bottleneck link.